The Word Problem for Inverse Monoids Presented by One Idempotent Relator
نویسندگان
چکیده
Birget, J.-C., SW. Margolis and J.C. Meakin, The word problem for inverse monoids presented by one idempotent relator, Theoretical Computer Science 123 (1994) 2733289. We study inverse monoids presented by a finite set of generators and one relation e= I, where e is a word representing an idempotent in the free inverse monoid, and 1 is the empty word. We show that (1) the word problem is solvable by a polynomial-time algorithm; (2) every congruence class (in the free monoid) with respect to such a presentation is a deterministic context-free language. Such congruence classes can be viewed as generalizations of parenthesis languages; and (3) the word problem is solvable by a linear-time algorithm in the more special case where e is a “positively labeled” idempotent.
منابع مشابه
On One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملDivisibility problem for one relator monoids
Theorem 1 The word problem for any 1-relator monoids can be reduced to the left side divisibility problem for monoids M presented in 2 generators by 1 defining relation of the form aU = bV . For the solution of this problem it sufficies to find an algorithm to recognize for any word aW (or for any word bW ) whether or not it is left side divisible in M by the letter b (accordingly by the letter...
متن کاملDecision Problems for Inverse Monoids Presented by a Single Sparse Relator
We study a class of inverse monoids of the form M = Inv〈X |w = 1〉, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the set of words in (X ∪X) that represent the identity in M is a deterministic context free language, and that the set of geodesics in the Schützenberger graph of ...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملThe Idempotent Problem for an Inverse Monoid
We generalize the word problem for groups, the formal language of all words in the generators that represent the identity, to inverse monoids. In particular, we introduce the idempotent problem, the formal language of all words representing idempotents, and investigate how the properties of an inverse monoid aer related to the formal language properties of its idempotent problem. In particular,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 123 شماره
صفحات -
تاریخ انتشار 1994